| 1. | Using a singly linked list
使用单向链接列表实现 |
| 2. | Singly linked lists are a powerful abstraction that allow you to represent numerous types of data
单链表是让您可以描述多种类型数据的一种有效抽象。 |
| 3. | Conceptually , a singly linked list of integers looks like the following diagram in a computer s memory
从概念上讲，在计算机内存中，整数的单链表如下图所示： |
| 4. | Using a singly linked list saves the overhead of updating an additional pointer for all operations as well as the memory for that pointer
使用单向链接表可省去更新所有操作的附加指针以及该指针的内存的系统开销。 |
| 5. | This article will discuss only singly linked lists ; the terms " linked lists " and " lists " will both be used to mean singly linked lists
本文将只讨论单链表；术语“链表（ linked list ） ”和“列表（ list ） ”都被用来表示单链表。 |
| 6. | A singly linked list is a data structure that has an ordered sequence of nodes in which each node contains a data element and a pointer to the next node in the sequence
单链表是拥有有序节点序列的数据结构，其中，每个节点包含一个数据元素以及一个指向序列中下一个节点的指针。 |
| 7. | List processing is one of the computer s biggest strengths ; singly linked lists provide the basis for a number of interesting algorithms and techniques that are useful in every aspect of programming
列表（ list ）处理是计算机最强功能之一；单链表（ singly linked lists ）为可以应用于编程各个方面的许多有趣的算法和技术提供了基础。 |
| 8. | Singly linked lists are a powerful abstraction that allow programmers to represent numerous types of data ; extending those lists to handle arbitrary data types can offer effective tools for processing data
单链表是使得程序员可以描述多种类型的数据的一种有效抽象；可以将链表的使用扩展到任意类型数据的处理当中，这为处理数据提供一个有效的工具。 |
| 9. | Firstly , singly linked lists are used as the data structure of this algorithm rather than doubly linked lists or trees as other algorithms use , so less memory space and running time are required . secondly , the relationship between the entry and exit points on the two polygons is found and argumentation , which , with the reasonable operations on the lists , reduces the times that the lists are traversed and allows the polygon to be input clockwise or counterclockwise
该算法使用单线性链表数据结构，与其它使用双链表或树结构的算法相比具有占用空间少及处理速度快的特点；其次，找出并论证两个多边形之间进、出点之间的关系，并通过合理的数据结构处理，减少了算法对多边形链表的遍历次数，而且允许多边形既可以按顺时针方向也可以按逆时针方向输入。 |
